Interactive Constrained Boolean Matrix Factorization Nelson Mukuze PauIi Miettinen Max-Planck-Institut für Informatik

Source URL: poloclub.gatech.edu

• Matrix theory
• Multivariate statistics
• Numerical linear algebra
• Matrix
• Factorization
• Algorithm
• Non-negative matrix factorization
• Principal component analysis

Boolean Operations using Generalized Winding Numbers Alec Jacobson Columbia University Abstract

Source URL: arxiv.org

• 3D computer graphics
• Mesh generation
• Triangle geometry
• Algebraic topology
• Complex analysis
• Winding number
• Triangle mesh
• Triangle

Smoothed Complexity Theory Markus Bl¨aser1 and Bodo Manthey2 1 Saarland University, 2

Source URL: www-cc.cs.uni-saarland.de

• Complexity classes
• Computational complexity theory
• Mathematical optimization
• Analysis of algorithms
• NP-complete problems
• Smoothed analysis
• IP
• PP
• NP
• Time complexity
• Average-case complexity
• Boolean satisfiability problem

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION ALGEBRA I (Common Core) Thursday, January 28, 2016 — 1:15 to 4:15 p.m.

Source URL: www.nysedregents.org

• Mathematical analysis
• Mathematics
• Exponentials
• Abstract algebra
• Functions and mappings
• E
• Exponential function
• Exponentiation
• Function
• Boolean algebra

A Brief Introduction to Fourier Analysis on the Boolean Cube

Source URL: theoryofcomputing.org

Introduction van der Waerden ideal W-ultrafilters

Source URL: spot.colorado.edu

• Mathematics
• Order theory
• Non-standard analysis
• Abstraction
• Structure
• Ultrafilter
• Boolean algebra
• Ideal
• Ordinal number

ALGEBRA I (COMMON CORE) The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION ALGEBRA I (Common Core) Thursday, January 28, 2016 — 1:15 to 4:15 p.m., only

Source URL: www.nysedregents.org

• Mathematics
• Mathematical analysis
• Analysis
• Completing the square
• Elementary algebra
• Algebra
• Differential calculus
• Functions and mappings
• Boolean algebra

PLTL Lesson Plan Last Edited: August 19, 2015 Topic: Big-Oh Notation Activity Guidelines

Source URL: cahsi.cs.utep.edu

• Computational complexity theory
• Theory of computation
• Mathematics
• Data types
• Primitive types
• Theoretical computer science
• Analysis of algorithms
• Algorithm
• Boolean data type
• NP
• Time complexity
• String

Harmonic Analysis of Boolean Functions, and applications in CS Lecture 3 March 3, 2008 Lecturer: Guy Kindler

Source URL: www.cs.huji.ac.il

Analysis of Boolean Functions (CMU 18-859S, SpringLecture 4: Locally testing Dictatorship with NAE; explicit PCPPs Jan. 25, 2005

Source URL: www.cs.cmu.edu